A Unified Framework for Two-guard Walk Problem
نویسنده
چکیده
We propose a unified framework to study the walk problem in a polygonal area by two collaborative guards. A walk is conducted by the two mobile guards on the area’s boundary. They start at an initial boundary point, move along the boundary, and may possibly meet together again at an ending boundary point. It is required that the two guards maintain their mutual visibility at all times. Depending the geometric properties of the polygonal area, a walk may or may not be possible. In this work, three versions of the problem, namely, general polygon walk, room walk and street walk, are characterized in a unified manner in our framework. One additional merit of our framework is its simplicity. Applications of the walk problem by two guards include military rescue, area exploration, art gallery surveillance, etc.
منابع مشابه
A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملMeta-heuristic Algorithms for an Integrated Production-Distribution Planning Problem in a Multi-Objective Supply Chain
In today's globalization, an effective integration of production and distribution plans into a unified framework is crucial for attaining competitive advantage. This paper addresses an integrated multi-product and multi-time period production/distribution planning problem for a two-echelon supply chain subject to the real-world variables and constraints. It is assumed that all transportations a...
متن کاملA UNIFIED MODEL FOR RESOURCE-CONSTRAINED PROJECT SCHEDULING PROBLEM WITH UNCERTAIN ACTIVITY DURATIONS
In this paper we present a unified (probabilistic/possibilistic) model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations and a concept of a heuristic approach connected to the theoretical model. It is shown that the uncertainty management can be built into any heuristic algorithm developed to solve RCPSP with deterministic activity durations. The esse...
متن کاملTwo-Guard Walkability of Simple Polygons
A pair of points s and g on the boundary of a simple polygon P admits a walk if two guards can simultaneously walk along the two boundary chains of P from s to g such that they are always visible to each other. The walk is a counter-walk if one guard moves from s to g while the other moves from g to s in the same direction along the boundary and they are always visible to each other. The (count...
متن کاملA time-constrained variation of the Watchman's Walk problem
Given a graph and a single watchman, the objective of the Watchman’s Walk Problem is to find a closed dominating walk of minimum length which the watchman can traverse to efficiently guard the graph. When multiple guards are available, one natural variation is to assume fixed time constraints on the monitoring of vertices and attempt to minimize the number of guards required. We find upper boun...
متن کامل